On Shary's Algebraic Approach for Linear Interval Equations

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Shary's Algebraic Approach for Linear Interval Equations

A recent method by Shary for enclosing the solution set of a system of linear interval equations is derived in a new way. It is shown that the method converges to the fixed-point inverse, and that it has finite termination with probability 1.

متن کامل

Interval solutions for interval algebraic equations

In the framework of interval uncertainty, a well-known classical problem in numerical analysis is considered, namely, to find “the best” interval solution for interval system of linear algebraic equations. This problem is known to be NP-hard and can be solved via multiple linear programming. In present paper, a simple approach is proposed for some particular models of interval uncertainty. This...

متن کامل

Duality in linear interval equations

In this paper we nd solution of linear interval equation in dual form based on the generalizedprocedure of interval extension which is called interval extended zero method.Moreover, proposed method has signicant advantage, is that it substantially decreasesthe excess width eect.

متن کامل

Algebraic Solving of Complex Interval Linear Systems by Limiting ‎Factors‎

In this work, we propose a simple method for obtaining the algebraic solution of a complex interval linear system where coefficient matrix is a complex matrix and the right-hand-side vector is a complex interval vector. We first use a complex interval version of the Doolittle decomposition method and then we restrict the Doolittle's solution, by complex limiting factors, to achieve a complex in...

متن کامل

Methods For Interval Linear Equations

We discuss one known and five new interrelated methods for bounding the hull of the solution set of a system of interval linear equations. Each method involves a polynomial amount of computing; but requires considerably more effort than Gaussian elimination. However, each method can yield sharper results for appropriate problems. For certain problems, our methods can obtain sharp bounds for one...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Matrix Analysis and Applications

سال: 2000

ISSN: 0895-4798,1095-7162

DOI: 10.1137/s0895479898347472